Nonsmooth analysis and quasi-convexification in elastic energy minimization problems
نویسنده
چکیده
We consider an energy minimization problem for a two-component composite with fixed volume fractions. We study two questions. The first is the dependence of the minimum energy on the constraints and parameters. The second is the rigorous justification of the method of Lagrange multipliers for this problem. We are able to treat only cases with periodic or affine boundary condition. We show that the constrained energy is a smooth and convex function of the constraints. We also find that the Lagrange multiplier problem is a convex dual of the problem with constraints. And we show that these two results are closely linked with each other. Our main tools are the Hashin-Shtrikman variational principle and some results from nonsmooth analysis.
منابع مشابه
Nonsmooth Analysis and Quasi-convexiication in Elastic Energy Minimization Problems
We consider an energy minimization problem for a two-component composite with xed volume fractions. We study two questions. The rst is the dependence of the minimum energy on the constraints and parameters. The second is the rigorous justi-cation of the method of Lagrange multipliers for this problem. We are able to treat only cases with periodic or aane boundary condition. We show that the con...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملA convexification method for a class of global optimization problems with applications to reliability optimization
A convexification method is proposed for solving a class of global optimization problems with certain monotone properties. It is shown that this class of problems can be transformed into equivalent concave minimization problems using the proposed convexification schemes. An outer approximation method can then be used to find the global solution of the transformed problem. Applications to mixed-...
متن کاملLimited memory interior point bundle method for large inequality constrained nonsmooth minimization
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of hundreds or thousands of variables with various constraints. In this paper, we describe a new efficient adaptive limited memory interior point bundle method for large, possible nonconvex, nonsmooth inequality constrained optimization. The method is a hybrid of the nonsmooth variable met...
متن کاملNew Nonsmooth Equations-Based Algorithms for ℓ1-Norm Minimization and Applications
Recently, Xiao et al. proposed a nonsmooth equations-based method to solve the 1-norm minimization problem 2011 . The advantage of this method is its simplicity and lower storage. In this paper, based on new nonsmooth equations reformulation, we investigate new nonsmooth equations-based algorithms for solving 1-norm minimization problems. Under mild conditions, we show that the proposed algorit...
متن کامل